Sufficiency and Duality in Multiobjective Programming Involving Generalized (F,ρ)-Convexity
نویسندگان
چکیده
منابع مشابه
Sufficiency and Duality in Multiobjective Programming with Generalized (f, Ρ)-convexity
A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond–Weir type dual relating properly efficient solutions of the primal and dual problems.
متن کاملSufficiency and duality in multiobjective fractional programming problems involving generalized type I functions
*Correspondence: [email protected] Chung-Jen Junior College of Nursing, Health Sciences and Management, Dalin, 62241, Taiwan Abstract In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized (F,α,ρ ,d)-V-type I functions. Using the optimality conditions, we also investigate a parametric-type dua...
متن کاملSufficiency in multiobjective subset programming involving generalized type-I functions
In this paper, sufficient optimality conditions for a multiobjective subset programming problem are established under generalized (F ,α, ρ,d)-type-I functions.
متن کاملSecond Order Duality in Multiobjective Programming With Generalized Convexity
The purpose of this paper is concerned with a class of multi objective programming problems in which the objective functions and constrained functions are twice differentiable and containing the support functions of a compact convex set. For such mathematic programming, to deal with its dual problem, first, the concept of second order ( , ) B p r invexity is introduced. Further, the Mangasa...
متن کاملDuality for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity
The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2001
ISSN: 0022-247X
DOI: 10.1006/jmaa.2000.7396